package com.mrl.recursion;

/**
 * 递归测试
 *
 * @author 正义桑
 */
public class RecursionTest {
    public static void main(String[] args) {
        test(5);
    }

    public static void test(int i) {
        if (i > 2) {
            test(i - 1);
        }
        System.out.printf("n = %d\n", i);
    }
}
